Asymptotic Properties of a Random Graph with Duplications
نویسندگان
چکیده
منابع مشابه
Asymptotic Properties of a Random Graph with Duplications
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with stretched exponential decay; more precisely, the proportion of vertices of degree d tends to some positive number cd > 0 almost surely as the number of steps goes to infinity, and cd ∼ (eπ)1/2d...
متن کاملAsymptotic properties of a bold random walk.
In a recent paper we proposed a non-Markovian random walk model with memory of the maximum distance ever reached from the starting point (home). The behavior of the walker is different from the simple symmetric random walk only when she is at this maximum distance, where, having the choice to move either farther or closer, she decides with different probabilities. If the probability of a forwar...
متن کاملAsymptotic properties of coalescing random walks
A Coalescing random walk is an interacting particle system which can be described as the following. Suppose that there is one particle located at each integer position [0, n] at time point 0 and that a particle is chosen at random at any time point t among the remaining in [1, n] and moves one step in some direction, where the direction can be deterministic or stochastic. The particle coalesce ...
متن کامل$G$-asymptotic contractions in metric spaces with a graph and fixed point results
In this paper, we discuss the existence and uniqueness of fixed points for $G$-asymptotic contractions in metric spaces endowed with a graph. The result given here is a new version of Kirk's fixed point theorem for asymptotic contractions in metric spaces endowed with a graph. The given result here is a generalization of fixed point theorem for asymptotic contraction from metric s paces to metr...
متن کاملAsymptotic Behavior of the Random 3-Regular Bipartite Graph
In 2001, two numerical experiments were performed to observe whether or not the second largest eigenvalue of the adjacency matrix for the random cubic bipartite graph approaches 2 √ 2 as the size of the graph increases. In the first experiment, by Kevin Chang, the graphs were chosen using an algorithm that constructed entirely new graphs at each step using three random permutations, in contrast...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2015
ISSN: 0021-9002,1475-6072
DOI: 10.1239/jap/1437658604